An efficient approach for the rank aggregation problem

This paper presents some computational properties of the Rank-Distance, a measure of similarity between partial rankings. We show how this distance generalizes the Spearman footrule distance, preserving its good computational complexity: the Rank-Distance between two partial rankings can be computed in linear time, and the rank aggregation problem can be solved in polynomial time. Further, we present a generalization of the Rank-Distance to strings, which permits to solve the median string problem in polynomial time. This appears rather surprising to us given the fact that for non-trivial string distances, such as Edit-Distance, this problem is NP-Hard.